Prudent Self-Avoiding Walks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prudent Self-Avoiding Walks

We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating function is almost certainly not differentiably-finite.

متن کامل

Families of prudent self-avoiding walks

A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their starting point. Their enumeration was first addressed by Préa in 1997. He defined 4 classes of prudent walks, of increasing generality, and wrote a system of re...

متن کامل

Weakly prudent self-avoiding bridges

We define and enumerate a new class of self-avoiding walks on the square lattice, which we call weakly prudent bridges. Their definition is inspired by two previously-considered classes of self-avoiding walks, and can be viewed as a combination of those two models. We consider several methods for recursively generating these objects, each with its own advantages and disadvantages, and use these...

متن کامل

Anisotropic Self - Avoiding Walks

We consider a model of self-avoiding walks on the lattice Zd with different weights for steps in each of the 2d lattice directions. We find that the directiondependent mass for the two-point function of this model has three phases: mass positive in all directions; mass identically −∞; and masses of different signs in different directions. The final possibility can only occur if the weights are ...

متن کامل

Extendable Self-avoiding Walks

The connective constant μ of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be extended forwards (respectively, backwards) to a singly infinite self-avoiding walk. It is called doubly extendable if it may be extended in both directions simultan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Entropy

سال: 2008

ISSN: 1099-4300

DOI: 10.3390/e10030309